Reflections on Manner/Result Complementarity
نویسندگان
چکیده
Nonstative verbs from various lexical fields are often classified as either manner or result verbs—a distinction implicated in language acquisition (Behrend 1990, Gentner 1978, Gropen et al. 1991), as well as in argument realization. Intuitively speaking, manner verbs specify as part of their meaning a manner of carrying out an action, while result verbs specify the coming about of a result state. Verbs of each type are listed in (1). As the lists illustrate, the manner/result distinction crosscuts the transitive/intransitive distinction.
منابع مشابه
An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step
An infeasible interior-point algorithm for solving the$P_*$-matrix linear complementarity problem based on a kernelfunction with trigonometric barrier term is analyzed. Each (main)iteration of the algorithm consists of a feasibility step andseveral centrality steps, whose feasibility step is induced by atrigonometric kernel function. The complexity result coincides withthe best result for infea...
متن کاملLexicalized Meaning and Manner/Result Complementarity
We investigate the English verbs climb and cut, cited as counterexamples to manner/result complementarity: the proposal that verbs lexicalize either manner or result meaning components, but not both. Once their lexicalized meaning is identified and distinguished from contextually determined elements of meaning, cut and climb conform to manner/result complementarity. We show that cut is basicall...
متن کاملDomain Decomposition Methods for a Complementarity Problem∗
We introduce a family of parallel Newton-Krylov-Schwarz methods for solving complementarity problems. The methods are based on a smoothed grid sequencing method, a semismooth inexact Newton method, and a twogrid restricted overlapping Schwarz preconditioner. We show numerically that such an approach is highly scalable in the sense that the number of Newton iterations and the number of linear it...
متن کاملAn interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function
In this paper, an interior-point algorithm for $P_{ast}(kappa)$-Linear Complementarity Problem (LCP) based on a new parametric trigonometric kernel function is proposed. By applying strictly feasible starting point condition and using some simple analysis tools, we prove that our algorithm has $O((1+2kappa)sqrt{n} log nlogfrac{n}{epsilon})$ iteration bound for large-update methods, which coinc...
متن کامل